Universal equivalence relations on X N generated by permutation actions of countable subgroups of S ∞ Andrew Marks and

نویسنده

  • Jay Williams
چکیده

Let S∞ be the group of all permutations of N and X be a standard Borel space. Then the space XN of functions from N to X is a standard Borel space, and S∞ acts on this space by permutation where given x ∈ XN and g ∈ S∞, g · x(n) = x(g−1(n)). Given any countable subgroup G of S∞, we can likewise restrict this action to G and consider the induced orbit equivalence relation on XN, which we will note EX N G . Hjorth has asked [1] [2] whether given countable Borel equivalence relations E ⊆ F , if E is universal must F be universal? We are interested in this question in the setting of equivalence relations of the form EX N G above. However, we will modify the question and instead ask for a stronger form of universality known as uniform universality for which we currently have more traction to prove theorems. Suppose G and H are countable groups equipped with Borel actions on the standard Borel spaces X and Y with associated orbit equivalence relations relations EX G and E Y H . Then say a homomorphism f from E X G to EY H is uniform if there exists a function u : G → H such that for all g ∈ G and x ∈ X, we have f(g · x) = u(g) · f(x). This uniformity function u need not be a homomorphism from G to H in general, but in the case where G is a free group, then u may be assumed to be a homomorphism. We say that a Borel action of a countable group H on a standard Borel space Y generates a uniformly universal equivalence relation EY H if given any countable Borel equivalence relation EX G there exists a uniform Borel reduction from EX G to E Y H . We say that E Y H is uniformly weakly universal if there exists an injective uniform Borel homomorphism from every EX G to E Y H . For example, the usual argument that E(Fω, ωω) is universal also shows that it is uniformly universal. Of course, it is important to specify the action as well as the equivalence relation when we are discussing uniform universality. Note for example, that any universal countable Borel equivalence relation is uniformly universal for some Borel action of a countable group that generates it. This follows from the fact that if E is universal, then F vB E for every countable Borel equivalence relation F [4]. Thus, if E is universal and generated by a Borel action of G, we can embed E(Fω, ωω) into E, and and use this embedding to obtain a Borel action of Fω ∗G that generates E for

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Martin’s Conjecture, Arithmetic Equivalence, and Countable Borel Equivalence Relations

There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin’s conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this p...

متن کامل

Uniformity, Universality, and Computability Theory

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened ...

متن کامل

Uniformity, Universality, and Recursion Theory

We prove a number of results motivated by global questions of uniformity in recursion theory, and some longstanding open questions about universality of countable Borel equivalence relations. Our main technical tool is a class of games for constructing functions on free products of countable groups. These games show the existence of refinements of Martin’s ultrafilter on Turing invariant sets t...

متن کامل

The universality of polynomial time Turing equivalence

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel sets of these equivalence relations which are related to Martin’s ultrafilter on the Turing degrees.

متن کامل

Is the Turing Jump Unique? Martin’s Conjecture, and Countable Borel Equivalence Relations

In 1936, Alan Turing wrote a remarkable paper giving a negative answer to Hilbert’s Entscheidungsproblem [29]. Restated with modern terminology and in its relativized form, Turing showed that given any infinite binary sequence x ∈ 2ω, the set x′ of Turing machines that halt relative to x is not computable from x. This function x 7→ x′ is now known as the Turing jump, and it has played a singula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013